Mīmāṃsā Deontic Logic: Proof Theory and Applications
نویسندگان
چکیده
Starting with the deontic principles in Mı̄mām. sā texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this logic, resulting in decidability, complexity results and neighbourhood semantics. The latter is used to analyse a well known example of conflicting obligations from the Vedas.
منابع مشابه
Modalities over Action, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions — i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action language that allows the representation of concurrent and repetitive events; (2) a deontic language that allows the representation of “free choice permissions”; (3) a proof procedure that admits a logic programming sty...
متن کاملPossible World Semantics for Defeasible Deontic Logic
Defeasible Deontic Logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible lo...
متن کاملFaithful Semantical Embedding of a Dyadic Deontic Logic in HOL
A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higherorder theorem provers and proof assistants.
متن کاملKED: A Deontic Theorem Prover
Deontic logic (DL) is increasingly recognized as an indispensable tool in such application areas as formal representation of legal knowledge and reasoning, formal specification of computer systems and formal analysis of database integrity constraints. Despite this acknowledgement, there have been few attempts to provide computationally tractable inference mechanisms for DL (most notably [Bel87]...
متن کاملModeling Chisholm’s Logic of Obligation, Requirement, and Defeat
It is well known that Standard Deontic Logic (SDL) suffers from a number of troubling paradoxes. Despite many years of efforts to resolve the paradoxes, there is no consensus that such efforts have been successful, and indeed [Hansen, 2006] argues that the paradoxes are “alive and kicking.” These continued difficulties with SDL motivate careful study of nonstandard deontic logics, such as Chish...
متن کامل